Applications of combinatorial designs in computer science
نویسندگان
چکیده
منابع مشابه
Data Streams and Applications in Computer Science
This is a short survey of my work in data streams and related applications, such as communication complexity, numerical linear algebra, and sparse recovery. The goal is give a non-technical overview of results in data streams, and highlight connections between these different areas. It is based on my Presburger lecture award given at ICALP, 2014. 1 The Data Stream Model Informally speaking, a d...
متن کاملExtremal Combinatorics - With Applications in Computer Science
If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and search for the available there. But, it will not happen here. The book that we will offer right here is the soft file concept. This is what make you can easily find and get this extremal combinatorics with applications in computer science by reading this site. We offer you...
متن کاملComputer Science Technical Report Combinatorial Analysis of Star Graph Networks
It is well known that star graphs are strongly resilient like the n cubes in the sense that they are optimally fault tolerant and the fault diameter is increased only by one in the presence of maximum number of allowable faults [Lat93b, RS93]. We investigate star graphs under the conditions of forbidden faulty sets [Esf89] where all the neighbors of any node cannot be faulty simultaneously; we ...
متن کاملMosaics of combinatorial designs
Abstract. Looking at incidence matrices of t (v, k, λ) designs as v×b matrices with 2 possible entries, each of which indicates incidences of a t -design, we introduce the notion of a c -mosaic of designs, having the same number of points and blocks, as a matrix with c different entries, such that each entry defines incidences of a design. In fact, a v×b matrix is decomposed in c incidence matr...
متن کاملApplications of Orthogonal Arrays to Computer Science
Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisticians motivated by their applications to design of experiments. In recent years, they have found numerous applications in computer science. Among their applications are derandomization of algorithms, random pattern testing of VLSI chips, authentication codes, universal hash functions, threshold schemes, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Computing Surveys
سال: 1989
ISSN: 0360-0300,1557-7341
DOI: 10.1145/66443.66446